A new characterization of proper interval graphs
نویسندگان
چکیده
منابع مشابه
A matrix characterization of interval and proper interval graphs
In this work a matrix representation that characterizes the interval and proper interval graphs is presented, which is useful for the efficient formulation and solution of optimization problems, such as the k-cluster problem. For the construction of this matrix representation every such graph is associated with a node versus node zero–one matrix. In contrast to representations used in most of t...
متن کاملCharacterization and recognition of proper tagged probe interval graphs
Interval graphs were used in the study of genomics by the famous molecular biologist Benzer. Later on probe interval graphs were introduced by Zhang as a generalization of interval graphs for the study of cosmid contig mapping of DNA. A tagged probe interval graph (briefly, TPIG) is motivated by similar applications to genomics, where the set of vertices is partitioned into two sets, namely, pr...
متن کاملThe Roberts characterization of proper and unit interval graphs
In this note, a constructive proof that the classes of proper interval graphs and unit interval graphs coincide is given, a result originally established by Fred S. Roberts. Additionally, the proof yields a linear-time and space algorithm to compute a unit interval representation, given a proper interval graph as input. © 2007 Elsevier B.V. All rights reserved.
متن کاملClosed graphs are proper interval graphs
Let G be a connected simple graph. We prove that G is a closed graph if and only if G is a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.
متن کاملCutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
We give a linear-time algorithm to compute the cutwidth of threshold graphs, thereby resolving the computational complexity of cutwidth on this graph class. Although our algorithm is simple and intuitive, its correctness proof relies on a series of non-trivial structural results, and turns out to be surprisingly complex. Threshold graphs are a well-studied subclass of interval graphs and of spl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1992
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90135-3